Random knapsack in expected polynomial time
نویسندگان
چکیده
منابع مشابه
Coloring Sparse Random k-Colorable Graphs in Polynomial Expected Time
Feige and Kilian [5] showed that finding reasonable approximative solutions to the coloring problem on graphs is hard. This motivates the quest for algorithms that either solve the problem in most but not all cases, but are of polynomial time complexity, or that give a correct solution on all input graphs while guaranteeing a polynomial running time on average only. An algorithm of the first ki...
متن کاملMinimum Coloring Random and Semi-Random Graphs in Polynomial Expected Time
We present new algorithms for k-coloring and minimum (x(G)-) coloring random and semi-random kcolorable graphs in polynomial expected time. The random graphs are drawn from the G(n,p, k) model and the semi-random graphs are drawn from the G s ~ ( n , p , k) model. In both models, an adversary initially splits the n vertices into IC color classes, each of size @(n). Then the edges between vertic...
متن کاملByzantine Agreement in Polynomial Expected Time
In the classic asynchronous Byzantine agreement problem, communication is via asynchronous message-passing and the adversary is adaptive with full information. In particular, the adversary can adaptively determine which processors to corrupt and what strategy these processors should use as the algorithm proceeds; the scheduling of the delivery of messages is set by the adversary, so that the de...
متن کاملFiltering Bounded Knapsack Constraints in Expected Sublinear Time
We present a highly efficient incremental algorithm for propagating bounded knapsack constraints. Our algorithm is based on the sublinear filtering algorithm for binary knapsack constraints by Katriel et al. and achieves similar speed-ups of one to two orders of magnitude when compared with its lineartime counterpart. We also show that the representation of bounded knapsacks as binary knapsacks...
متن کاملNear-Optimal Dominating Sets in Dense Random Graphs in Polynomial Expected Time
The dominating set problem is the following: Given a graph G(V, E) and a positive integer < Ivl, is there a subset V' C_ V, (called a dominating set), with Ig'l < k such that for all u in V V ~ there is a v in V r for which {u,v} E E? The problem is NP-Complete (see [GJ,79]), even for planar graphs with maximum degree 3. We exanfine here the "average case" complexity of the problem, following t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2004
ISSN: 0022-0000
DOI: 10.1016/j.jcss.2004.04.004